Weighted restriction estimates and application to Falconer distance set problem
نویسندگان
چکیده
We prove some weighted Fourier restriction estimates using polynomial partitioning and refined Strichartz estimates. As application we obtain improved spherical average decay rates of the transform fractal measures, therefore improve results for Falconer distance set conjecture in three higher dimensions.
منابع مشابه
Additive Energy and the Falconer Distance Problem in Finite Fields
We study the number of the vectors determined by two sets in d-dimensional vector spaces over finite fields. We observe that the lower bound of cardinality for the set of vectors can be given in view of an additive energy or the decay of the Fourier transform on given sets. As an application of our observation, we find sufficient conditions on sets where the Falconer distance conjecture for fin...
متن کاملSome Connections between Falconer ’ s Distance Set Conjecture and Sets of Furstenburg Type Nets
In this paper we investigate three unsolved conjectures in geometric combinatorics, namely Falconer’s distance set conjecture, the dimension of Furstenburg sets, and Erdös’s ring conjecture. We formulate natural δdiscretized versions of these conjectures and show that in a certain sense that these discretized versions are equivalent.
متن کاملThe Fréchet Distance Problem in Weighted Regions
where α and β range over all continuous non-decreasing functions with α(0) = β(0) = 0 and α(1) = β(1) = 1, and d′ is a distance metric between points. The functions α and β are also refereed to as reparametrizations. We call (α, β) a matching between P and Q. The Fréchet distance is described intuitively by a man walking a dog on a leash. The man follows a curve (path), and the dog follows anot...
متن کاملThe Erdös-Falconer Distance Problem on the Unit Sphere in Vector Spaces Over Finite Fields
Hart, Iosevich, Koh and Rudnev (2007) show, using Fourier analysis method, that the finite Erdös-Falconer distance conjecture holds for subsets of the unit sphere in Fdq . In this note, we give a graph theoretic proof of this result.
متن کاملK–Distance Sets, Falconer Conjecture, and Discrete Analogs
In this paper we prove a series of results on the size of distance sets corresponding to sets in the Euclidean space. These distances are generated by bounded convex sets and the results depend explicitly on the geometry of these sets. We also use a diophantine mechanism to convert continuous results into distance set estimates for discrete point sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Mathematics
سال: 2021
ISSN: ['0002-9327', '1080-6377']
DOI: https://doi.org/10.1353/ajm.2021.0005